Combinatorial Properties of Hechler Forcing

نویسندگان

  • Jörg Brendle
  • Haim Judah
  • Saharon Shelah
چکیده

Using a notion of rank for Hechler forcing we show: 1) assuming ω 1 = ω L 1 , there is no real in V [d] which is eventually different from the reals in L[d], where d is Hechler over V ; 2) adding one Hechler real makes the invariants on the left-hand side of Cichoń’s diagram equal ω1 and those on the right-hand side equal 2 ω and produces a maximal almost disjoint family of subsets of ω of size ω1; 3) there is no perfect set of random reals over V in V [r][d], where r is random over V and d Hechler over V [r], thus answering a question of the first and second authors. 1991 Mathematics subject classification. Primary 03E40, Secondary 03E15 28A05 54H05

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hechler and Laver Trees

A Laver tree is a tree in which each node splits infinitely often. A Hechler tree is a tree in which each node splits cofinitely often. We show that every analytic set is either disjoint from the branches of a Heckler tree or contains the branches of a Laver tree. As a corollary we deduce Silver Theorem that all analytic sets are Ramsey. We show that in Godel’s constructible universe that our r...

متن کامل

2 00 3 Hechler ’ s theorem for the meager ideal

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler’s classical result in the theory of forcing.

متن کامل

3 Hechler ’ s theorem for the null ideal

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler’s classical result in the theory of forcing, and the stat...

متن کامل

Further Combinatorial Properties of Cohen Forcing

The combinatorial properties of Cohen forcing imply the existence of a countably closed, א2-c.c. forcing notion P which adds a C(ω2)-name Q for a σ-centered poset such that forcing with Q over V P×C(ω2) adds a real not split by V C(ω2) ∩ [ω] and preserves that all subfamilies of size ω1 of the Cohen reals are unbounded.

متن کامل

2 00 3 Hechler ’ s theorem for the null ideal Masaru Kada

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler’s classical result in the theory of forcing, and the stat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 58  شماره 

صفحات  -

تاریخ انتشار 1992